Research Problems in Combinatorial Auctions
نویسنده
چکیده
Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes, network routing and furniture. Because of complementarities or substitution effects between the different assets, bidders have preferences not just for particular items but for sets of items. For this reason, economic efficiency is enhanced if bidders are allowed to bid on bundles or combinations of different assets. This note outlines some of the underlying theory and identifies some research questions. The reader interested in more details on research in this are should consult the survey paper by de Vries and myself on combinatorial auctions. I am greatful for useful conversations with Sushil Bikhchandani, Sven de Vries, Peter Eso, Tuomas Sandholm, James Schummer and Subhash Suri. (Auctions; Combinatorial Optimization ) ∗Department of Managerial Economics and Decision Sciences, Kellogg School of Management, Northwestern University, Evanston IL 60208. e-mail: [email protected]
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملAn Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملToward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions
M auctions involve selling several distinct items simultaneously, where bidders can bid on the whole or any part of the lot. Such auctions are referred to as combinatorial auctions. Examples of such auctions include truck delivery routes, industrial procurement, and FCC spectrum. Determining winners in such auctions is an NP-hard problem, and significant research is being conducted in this area...
متن کاملTowards Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions
Many auctions involve selling several distinct items simultaneously, where bidders can bid on the whole or any part of the lot. Such auctions are referred to as combinatorial auctions. Examples of such auctions include truck delivery routes, furniture, and FCC spectrum. Determining winners in such auctions is an NP-complete problem and significant research is being conducted in this area. Howev...
متن کاملIntroduction to Combinatorial Auctions
Combinatorial auctions are those auctions in which bidders can place bids on combinations of items, called “packages,” rather than just individual items. The study of combinatorial auctions is inherently interdisciplinary. Combinatorial auctions are in the first place auctions, a topic extensively studied by economists. Package bidding brings in operations research, especially techniques from c...
متن کامل